2 3 Ju n 19 99 Using Automata to obtain Regular Expressions for Induced Actions ∗
نویسنده
چکیده
Presentations of Kan extensions of category actions provide a natural framework for expressing induced actions, and therefore a range of different combinatorial problems. Rewrite systems for Kan extensions have been defined and a variation on the Knuth-Bendix completion procedure can be used to complete them – when possible. Regular languages and automata are a useful way of expressing sets and actions, and in this paper we explain how to use rewrite systems for Kan extensions to construct automata expressing the induced action and how sets of normal forms can be calculated by obtaining language equations from the automata.
منابع مشابه
Regular Expressions From Deterministic Finite Automata, Revisited
We continue our research on the conversion of deterministic finite automata to equivalent regular expressions from [H. Gruber, M. Holzer: Provably Shorter Regular Expressions from Deterministic Finite Automata. In: 12th DLT, Number 5257 of LNCS, 2008], where it was shown that every language over a binary alphabet accepted by an n-state deterministic finite automaton can be converted into an equ...
متن کاملSeries-Parallel Automata and Short Regular Expressions
Computing short regular expressions equivalent to a given finite automaton is a hard task. In this work we present a class of acyclic automata for which it is possible to obtain in time O(n2 log n) an equivalent regular expression of size O(n). A characterisation of this class is made using properties of the underlying digraphs that correspond to the series-parallel digraphs class. Using this c...
متن کاملShorter Regular Expressions from Finite-State Automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regular expressions from finitestate automata, the resulting regular expressions are often very long and complicated. We examine the minimization of finite-state automata to obtain shorter expressions first. Then, we introd...
متن کاملOn Average Behaviour of Regular Expressions in Strong Star Normal Form
For regular expressions in (strong) star normal form a large set of efficient algorithms is known, from conversions into finite automata to characterisations of unambiguity. In this paper we study the average complexity of this class of expressions using analytic combinatorics. As it is not always feasible to obtain explicit expressions for the generating functions involved, here we show how to...
متن کاملOn the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
Extended regular expressions (with complement and intersection) are used in many applications due to their succinctness. In particular, regular expressions extended with intersection only (also called semi-extended) can already be exponentially smaller than standard regular expressions or equivalent nondeterministic finite automata (NFA). For practical purposes it is important to study the aver...
متن کامل